Top k Optimal Sequenced Route Query with POI Preferences

Abstract The optimal sequenced route (OSR) query, as a popular problem in planning for smart cities, searches minimum-distance passing through several POIs specific order from starting position. In reality, are usually rated, which helps users making decisions. Existing OSR queries neglect the fact that same category could have different scores, may affect users’ choices. this paper, we study novel variant of namely Rating Constrained Optimal Sequenced Route query (RCOSR) , rating score each POI should exceed threshold. To efficiently process RCOSR queries, first extend existing TD-OSR algorithm to propose baseline method, called MTDOSR . tackle shortcomings MTDOSR, try design new algorithm, Subroute Expansion (OSE) Algorithm enhance OSE Reference Node Inverted Index (RNII) accelerate distance computation pairs and quickly retrieve category. make full use RNII, further efficient Recurrent (ROSE) recurrently utilizes compute current guiding path update guide expansion. Then, our techniques handle variation RC k query. experimental results demonstrate proposed significantly outperforms approaches.